Capacity-Achieving CPM Schemes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity-Achieving Schemes for Finite-State Channels

Capacity-Achieving Schemes for Finite-State Channels

متن کامل

Capacity-Achieving PIR Schemes with Optimal Sub-Packetization

Suppose a database containing M records is replicated across N servers, and a user wants to privately retrieve one record by accessing the servers such that identity of the retrieved record is secret against any up to T servers. A scheme designed for this purpose is called a private information retrieval (PIR) scheme. In practice, capacity-achieving and small sub-packetization are both desired ...

متن کامل

On Sub-Packetization of Capacity-Achieving PIR Schemes for MDS Coded Databases

Consider the problem of private information retrieval (PIR) over a distributed storage system where M records are stored across N servers by using an [N,K] MDS code. For simplicity, this problem is usually referred as the coded-PIR problem. The capacity of coded-PIR with privacy against any individual server was determined by Banawan and Ulukus in 2016, i.e., CC-PIR = (1 + K N + · · · + K M−1 N...

متن کامل

Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small Fields

Suppose a database containing M records is replicated across N servers, and a user wants to privately retrieve one record by accessing the servers such that identity of the retrieved record is secret against any up to T servers. A scheme designed for this purpose is called a T -private information retrieval (T PIR) scheme. Three indexes are concerned for PIR schemes: (1) rate, indicating the am...

متن کامل

Capacity Pre-log Achieving Schemes for Stationary Frequency-flat Multi-antenna Channels

We analyze the Mutual Information of stationary FrequencyFlat MIMO Channels, that are hence characterized by a Doppler spectrum. Absence of Channel State Information at Transmitter or Receiver (no CSIT/CSIR) is assumed. For peakpower limited SISO frequency-flat channels with stationary Gaussian fading, it has been shown by Lapidoth [1] that at high SNR, the capacity is determined by a pre-log f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2010

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2010.2040861